1![Infeasibility of Instance Compression and Succinct PCPs for NP∗ Lance Fortnow Rahul Santhanam March 19, 2010 Infeasibility of Instance Compression and Succinct PCPs for NP∗ Lance Fortnow Rahul Santhanam March 19, 2010](https://www.pdfsearch.io/img/6465b244d3672ecea5d3c0288f740f52.jpg) | Add to Reading ListSource URL: people.cs.uchicago.edu- Date: 2010-05-13 09:39:01
|
---|
2![On the Complexity of Succinct Zero-Sum Games Lance Fortnow∗ Department of Computer Science University of Chicago Chicago, IL USA On the Complexity of Succinct Zero-Sum Games Lance Fortnow∗ Department of Computer Science University of Chicago Chicago, IL USA](https://www.pdfsearch.io/img/804cf0fbfa3acf1bfa2cc395cd729185.jpg) | Add to Reading ListSource URL: users.cms.caltech.edu- Date: 2005-06-21 20:41:38
|
---|
3![Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.](https://www.pdfsearch.io/img/d25dc8b7f78a062d63196d9d96babc33.jpg) | Add to Reading ListSource URL: people.cs.uchicago.eduLanguage: English - Date: 2014-04-12 08:04:57
|
---|
4![Computation in a Distributed Information Market Joan Feigenbaum Lance Fortnow David Pennock Computation in a Distributed Information Market Joan Feigenbaum Lance Fortnow David Pennock](https://www.pdfsearch.io/img/8f67b3e1bd93a7b80b6c580e53a0472d.jpg) | Add to Reading ListSource URL: cs-www.cs.yale.eduLanguage: English - Date: 2003-06-14 11:28:13
|
---|
5![Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192. Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.](https://www.pdfsearch.io/img/05855b1b393d63d78d48d42778f23685.jpg) | Add to Reading ListSource URL: people.cs.uchicago.eduLanguage: English - Date: 2014-04-12 05:40:19
|
---|
6![Diagonalization Lan
e Fortnow y NEC Resear
h Institute Diagonalization Lan
e Fortnow y NEC Resear
h Institute](https://www.pdfsearch.io/img/32c29cec055528a8f6383c408abab1cb.jpg) | Add to Reading ListSource URL: lance.fortnow.comLanguage: English - Date: 2016-02-15 15:45:38
|
---|
7![Infinitely-Often Autoreducible Sets Richard Beigel∗, Temple University Lance Fortnow†, University of Chicago Frank Stephan‡, National University of Singapore Infinitely-Often Autoreducible Sets Richard Beigel∗, Temple University Lance Fortnow†, University of Chicago Frank Stephan‡, National University of Singapore](https://www.pdfsearch.io/img/4a4593910a29e3ba76ded9dade800338.jpg) | Add to Reading ListSource URL: people.cs.uchicago.eduLanguage: English - Date: 2010-05-13 09:39:02
|
---|
8![TM Piccadilly Software Presents TM Piccadilly Software Presents](https://www.pdfsearch.io/img/2998f0c65273bce3a86ff5cff2461d69.jpg) | Add to Reading ListSource URL: lance.fortnow.comLanguage: English - Date: 2015-09-01 10:59:17
|
---|
9![Betting Boolean-Style: A Framework for Trading in Securities Based on Logical Formulas Lance Fortnow 1 Department of Computer Science, University of Chicago, 1100 E. 58th St., Chicago, IL 60637 Betting Boolean-Style: A Framework for Trading in Securities Based on Logical Formulas Lance Fortnow 1 Department of Computer Science, University of Chicago, 1100 E. 58th St., Chicago, IL 60637](https://www.pdfsearch.io/img/fa3d426a687baa0680a4ebb6a749debc.jpg) | Add to Reading ListSource URL: dpennock.com |
---|
10![Combinatorial Betting YILING CHEN Yahoo! Research LANCE FORTNOW University of Chicago EVDOKIA NIKOLOVA Combinatorial Betting YILING CHEN Yahoo! Research LANCE FORTNOW University of Chicago EVDOKIA NIKOLOVA](https://www.pdfsearch.io/img/74332bcee6b5daa47bb14d4d69833e08.jpg) | Add to Reading ListSource URL: www.sigecom.orgLanguage: English - Date: 2007-12-23 21:18:25
|
---|